Perfect Matchings in Claw-free Cubic Graphs
نویسنده
چکیده
Lovász and Plummer conjectured that there exist a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2cn perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour. We prove that every claw-free cubic n-vertex graph with no cutedge has more than
منابع مشابه
Cubic Graphs, Disjoint Matchings and Some Inequalities
For k = 2, 3 and a cubic graph G let νk(G) denote the size of a maximum k-edge-colorable subgraph of G. Mkrtchyan, Petrosyan and Vardanyan proved that ν2(G) ≥ 4 5 · |V (G)|, ν3(G) ≥ 7 6 · |V (G)| [13]. They were also able to show that ν2(G) + ν3(G) ≥ 2 · |V (G)| [3] and ν2(G) ≤ |V (G)|+2·ν3(G) 4 [13]. In the present work, we show that the last two inequalities imply the first two of them. Moreo...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملMatchings in Benjamini–schramm Convergent Graph Sequences
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A graph parameter is said to be estimable if it converges along every Benjamini– Schramm convergent sparse graph sequence. We prove that the normalized logarithm o...
متن کاملA New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
We prove that every n-vertex cubic bridgeless graph has at least n/2 perfect matchings and give a list of all 17 such graphs that have less than n/2 + 2 perfect matchings.
متن کاملThe Structure of Claw-Free Perfect Graphs
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed [6] successfully described how elementary graphs can be built using line-graphs of bipartite graphs using local augmentation. How...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011